The GENITOR Algorithm and Selection Pressure: Why Rank-Based Allocation of Reproductive Trials is Best

نویسنده

  • L. Darrell Whitley
چکیده

This paper reports work done over the past three years using rank-based allocation of reproductive trials. New evidence and arguments are presented which suggest that allocating reproductive trials according to rank is superior to tness proportionate reproduction. Ranking can not only be used to slow search speed, but also to increase search speed when appropriate. Furthermore, the use of ranking provides a degree of control over selective pressure that is not possible with tness proportionate reproduction. The use of rank-based allocation of reproductive trials is discussed in the context of 1) Holland's schema theorem, 2) DeJong's standard test suite, and 3) a set of neural net optimization problems that are larger than the problems in the standard test suite. The GENITOR algorithm is also discussed; this algorithm is speciically designed to allocate reproductive trials according to rank.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Supplier Selection and Order Allocation under Risk: Iranian Oil and Gas Drilling Companies

This paper addresses supplier selection and order allocation problem while considering the losses arising from the risk of sanction in Iran’s Oil & Gas Drilling Industry. In the proposed study, two general classes of items and two different classes of suppliers are considered. AHP is first used to rank the potential suppliers. Then, a multi-objective linear programming model is proposed t...

متن کامل

Selection Methods for Evolutionary Algorithms

3.1 Fitness Proportionate Pelection (FPS) 3.2 Windowing 3.3 Sigma Scaling 3.4 Linear Scaling 3.5 Sampling Algorithms 3.6 Ranking 3.7 Linear Ranking 3.8 Exponential Ranking 3.9 Tournament Selection 3.10 Genitor or Steady State Models 3.11 Evolution Strategy and Evolutionary Programming Methods 3.12 Evolution Strategy Approaches 3.13 Top-n Selection 3.14 Evolutionary Programming Methods 3.15 The ...

متن کامل

Congestion estimation of router input ports in Network-on-Chip for efficient virtual allocation

Effective and congestion-aware routing is vital to the performance of network-on-chip. The efficient routing algorithm undoubtedly relies on the considered selection strategy. If the routing function returns a number of more than one permissible output ports, a selection function is exploited to choose the best output port to reduce packets latency. In this paper, we introduce a new selection s...

متن کامل

تصادفی سازی در مطالعات کارآزمایی بالینی: از تئوری تا عمل

Background & Aim: Randomized clinical trials (RCTs) are studies which are able to provide the most valid evidence to compare various interventions in health research. Biases can affect the quality of research and ultimately make the results of a study invalid. One of the most important biases is selection bias. The best way to reduce selection bias is the use of random allocation. The aim of th...

متن کامل

Online Streaming Feature Selection Using Geometric Series of the Adjacency Matrix of Features

Feature Selection (FS) is an important pre-processing step in machine learning and data mining. All the traditional feature selection methods assume that the entire feature space is available from the beginning. However, online streaming features (OSF) are an integral part of many real-world applications. In OSF, the number of training examples is fixed while the number of features grows with t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1989